On Neighborhood Tree Search

We consider the neighborhood tree induced by alternating the use of different neighborhood structures within a local search descent. We investigate the issue of designing a search strategy operating at the neighborhood tree level by exploring different paths of the tree in a heuristic way. We show that allowing the search to 'backtrack' to a previously visited solution and resuming the iterative variable neighborhood descent by 'pruning' the already explored neighborhood branches leads to the design of effective and efficient search heuristics. We describe this idea by discussing its basic design components within a generic algorithmic scheme and we propose some simple and intuitive strategies to guide the search when traversing the neighborhood tree. We conduct a thorough experimental analysis of this approach by considering two different problem domains, namely, the Total Weighted Tardiness Problem (SMTWTP), and the more sophisticated Location Routing Problem (LRP). We show that independently of the considered domain, the approach is highly competitive. In particular, we show that using different branching and backtracking strategies when exploring the neighborhood tree allows us to achieve different trade-offs in terms of solution quality and computing cost.Comment: Genetic and Evolutionary Computation Conference (GECCO'12) (2012

Modelisation dynamique des transferts de chaleur et d'humidite a travers le vetement. Couplage avec deux modeles de thermoregulation humaine

SIGLEINIST T 75191 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc

Variable neighborhood search algorithm for the green vehicle routing problem

This article discusses the ecological vehicle routing problem with a stop at a refueling station titled Green-Vehicle Routing Problem. In this problem, the refueling stations and the limit of fuel tank capacity are considered for the construction of a tour. We propose a variable neighborhood search to solve the problem. We tested and compared the performance of our algorithm intensively on datasets existing in the literature

Feature selection based on discriminative power under uncertainty for computer vision applications

Feature selection is a prolific research field, which has been widely studied in the last decades and has been successfully applied to numerous computer vision systems. It mainly aims to reduce the dimensionality and thus the system complexity. Features have not the same importance within the different classes. Some of them perform for class representation while others perform for class separation. In this paper, a new feature selection method based on discriminative power is proposed to select the relevant features under an uncertain framework, where the uncertainty is expressed through a possibility distribution. In an uncertain context, our method shows its ability to select features that can represent and discriminate between classes